Integrating Action Calculi and Description Logics

نویسندگان

  • Conrad Drescher
  • Michael Thielscher
چکیده

General action languages, like e.g. the Situation Calculus, use full classical logic to represent knowledge of actions and their effects in dynamic domains. Description Logics, on the other hand, have been developed to represent static knowledge with the help of decidable subsets of first order logic. In this paper, we show how to use Description Logic as the basis for a decidable yet still expressive action formalism. To this end, we use ABoxes as decidable state descriptions in the basic Fluent Calculus. As a second contribution, we thus obtain an independent semantics – based on a general action formalism – for a recent method for ABox-Update.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparing logics for rewriting: rewriting logic, action calculi and tile logic

The large di*usion of concurrent and distributed systems has spawned in recent years a variety of new formalisms, equipped with features for supporting an easy speci-cation of such systems. The aim of our paper is to analyze three proposals, namely rewriting logic, action calculi and tile logic, chosen among those formalisms designed for the description of rule-based systems. For each of these ...

متن کامل

Action Languages, Temporal Action Logics and the Situation Calculus

In the rst part of the paper, we investigate the relationship between the action description language C and the situation calculus. Action description languages are based on the model of time that includes only two time instants: 0 for the beginning of the execution of an action and 1 for the end. The ontology of time in the situation calculus is much more elaborate. We show how to bridge the g...

متن کامل

Planning in Action Formalisms based on DLs: First Results

In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We prove that the plan existence problem is decidable for actions described in fragments of ALCQIO. More precisely, we show that its computational complexity coincides with the one of projection for DLs between ALC and ALCQIO.

متن کامل

Integrating Description Logics and Relational Databases

In this paper, we compare description logics with relational databases with respect to their treatment of schema constraints, the languages used to express these constraints, and the approaches to query answering and constraint checking. Our analysis reveals a significant overlap between the two formalisms. Inspired by the integrity constraints of relational databases, we define a notion of int...

متن کامل

Discovery Using Heterogeneous Combined Logics

Introduction Research in hybrid logic systems and, later, description logics, has revealed a tradeoff between the expressivity of a logical formalism, and the complexity of reasoning within that formalism. This is why, for instance, tractable inference procedures are known for certain classes of description logics and for (some) formalisms underlying knowledge representation on the Semantic Web...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007